Transductions in arithmetic
نویسندگان
چکیده
منابع مشابه
Composition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutions and graph products. When graphs are considered as automata, path transductions correspond to rational word transductions on the accepted languages. They define strict subclasses of monadic transductions and preserve...
متن کاملTransductions Rationnelles Décroissantes
— A characterization oj decreasing rational transductions is given, We show that x is a decreasing rational transduction jrom X* into Y* if and only ij there exist an alphabet Z, two alphabetic morphisms h:Z* -> X*,g:Z* -» Y*t with h e-jree and a regular language R o Z* such that x = go(nR)oh~. Résumé. — Nous proposons une caracterisation des transductions rationnelles décroissantes. Nous montr...
متن کاملIteration of rational transductions
The purpose of this paper is to show connections between iterated length preserving rational transductions and linear space computations Hence we study the smallest family of transductions containing length preserving rational transductions and closed under union composition and iteration We give several characterizations of this class using re stricted classes of length preserving rational tra...
متن کاملOn implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which reflect accurately this characterization, and we study their properties and their algorithmic aspects. We base our construct on the observation that there is a connection between recognizable transductions and languages cons...
متن کاملStreamability of Nested Word Transductions
We consider the problem of evaluating in streaming (i.e. in a single left-toright pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height of the input word. We show that it is decidable in coNPTime for a nested word transduction defined b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2016
ISSN: 0168-0072
DOI: 10.1016/j.apal.2015.11.002